Search for: All records

Monitoring systems have hundreds or thousands of distributed sensors gathering and transmitting real-time streaming data. The early detection of events in these systems, such as an earthquake in a seismic monitoring system, is the base for essential tasks as warning generations. To detect such events is usual to compute pairwise correlation across the disparate signals generated by the sensors. Since the data sources (e.g., sensors) are spatially separated, it is essential to consider the lagged correlation between the signals. Besides, many applications require to process a specific band of frequencies depending on the event’s type, demanding a pre-processing step of filtering before computing correlations. Due to the high speed of data generation and a large number of sensors in these systems, the operations of filtering and lagged cross-correlation need to be efficient to provide real-time responses without data losses. This article proposes a technique named FilCorr that efficiently computes both operations in one single step. We achieve an order of magnitude speedup by maintaining frequency transforms over sliding windows. Our method is exact, devoid of sensitive parameters, and easily parallelizable. Besides our algorithm, we also provide a publicly available real-time system named Seisviz that employs FilCorr in its core mechanism for monitoring a seismometer network. We demonstrate that our technique is suitable for several monitoring applications as seismic signal monitoring, motion monitoring, and neural activity monitoring. 

An essential task on streaming time series data is to compute pairwise correlation across disparate signal sources to identify significant events. In many monitoring applications, such as geospatial monitoring, motion monitoring and critical infrastructure monitoring, correlation is observed at various frequency bands and temporal lags. In this paper, we consider computing filtered and lagged correlation on streaming time series data, which is challenging because the computation must be “in-sync” with the incoming stream for any detected events to be useful. We propose a technique to compute filtered and lagged correlation on streaming data efficiently by merging two individual operations: filtering and cross-correlations. We achieve an order of magnitude speed-up by maintaining frequency transforms over sliding windows. Our method is exact, devoid of sensitive parameters, and easily parallelizable. We demonstrate our technique in a seismic signal monitoring application. 

Signaling between pollen tube and female gametophyte ensures that only one pollen tube gets through but can re-establish access in case of failure. 

Abstract Background Compared to proteins, glycans, and lipids, much less is known about RNAs on the cell surface. We develop a series of technologies to test for any nuclear-encoded RNAs that are stably attached to the cell surface and exposed to the extracellular space, hereafter called membrane-associated extracellular RNAs (maxRNAs). Results We develop a technique called Surface-seq to selectively sequence maxRNAs and validate two Surface-seq identified maxRNAs by RNA fluorescence in situ hybridization. To test for cell-type specificity of maxRNA, we use antisense oligos to hybridize to single-stranded transcripts exposed on the surface of human peripheral blood mononuclear cells (PBMCs). Combining this strategy with imaging flow cytometry, single-cell RNA sequencing, and maxRNA sequencing, we identify monocytes as the major type of maxRNA+ PBMCs and prioritize 11 candidate maxRNAs for functional tests. Extracellular application of antisense oligos of FNDC3B and CTSS transcripts inhibits monocyte adhesion to vascular endothelial cells. Conclusions Collectively, these data highlight maxRNAs as functional components of the cell surface, suggesting an expanded role for RNA in cell-cell and cell-environment interactions. 

Heatmap regression-based models have significantly advanced the progress of facial landmark detection. However, the lack of structural constraints always generates inaccurate heatmaps resulting in poor landmark detection performance. While hierarchical structure modeling methods have been proposed to tackle this issue, they all heavily rely on manually designed tree structures. The designed hierarchical structure is likely to be completely corrupted due to the missing or inaccurate prediction of landmarks. To the best of our knowledge, in the context of deep learning, no work before has investigated how to automatically model proper structures for facial landmarks, by discovering their inherent relations. In this paper, we propose a novel Hierarchical Structured Landmark Ensemble (HSLE) model for learning robust facial landmark detection, by using it as the structural constraints. Different from existing approaches of manually designing structures, our proposed HSLE model is constructed automatically via discovering the most robust patterns so HSLE has the ability to robustly depict both local and holistic landmark structures simultaneously. Our proposed HSLE can be readily plugged into any existing facial landmark detection baselines for further performance improvement. Extensive experimental results demonstrate our approach significantly outperforms the baseline by a large margin to achieve a state-of-the-art performance.